منابع مشابه
Structural Transition in Random Mappings
In this paper we characterise the structural transition in random mappings with in-degree restrictions. Specifically, for integers 0 6 r 6 n, we consider a random mapping model T̂ r n from [n] = {1, 2, . . . , n} into [n] such that Ĝn, the directed graph on n labelled vertices which represents the mapping T̂ r n , has r vertices that are constrained to have in-degree at most 1 and the remaining v...
متن کاملHighest Trees of Random Mappings
We prove the exact asymptotic 1 − Θ( 1 √ n ) for the probability that the underlying graph of a random mapping of n elements possesses a unique highest tree. The property of having a unique highest tree turned out to be crucial in the solution of the famous Road Coloring Problem [7] as well as in the proof of the author’s result about the probability of being synchronizable for a random automat...
متن کاملRandom mappings with exchangeable in-degrees
A random mapping T D̂ n maps the set {1, 2, ..., n} into itself and it is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequence for the vertices is given by the variables D̂1, D̂2, ..., D̂n and, in some sense, Gn can be viewed as an analogue of the general i...
متن کاملImages and Preimages in Random Mappings
We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total predecessors.
متن کاملStrata of Random Mappings – a Combinatorial Approach
Let Fn denote the set of all mappings φ : {1, . . . , n} → {1, . . . , n} and assume that this set is equipped with the uniform distribution. Then a mapping φ ∈ Fn is usually called a random mapping. For our investigations it is convenient to represent random mappings by its functional graph Gφ, i.e. the graph consisting of the nodes 1, 2, . . . , n and of the edges (i, φ(i)), i = 1, . . . , n....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90040-t